Multi-focus microscope with HiLo algorithm for fast 3-D fluorescent imaging
نویسندگان
چکیده
منابع مشابه
Fast Calcium Imaging with Optical Sectioning via HiLo Microscopy
Imaging intracellular calcium concentration via reporters that change their fluorescence properties upon binding of calcium, referred to as calcium imaging, has revolutionized our way to probe neuronal activity non-invasively. To reach neurons densely located deep in the tissue, optical sectioning at high rate of acquisition is necessary but difficult to achieve in a cost effective manner. Here...
متن کاملFast and Accurate 3-D Imaging Algorithm with Linear Array Antennas for UWB Pulse Radars
Pulse radars with UWB signals are promising as a high-resolution imaging technique that can be used for the non-destructive measurement of surface details in industrial products such as antennas and aircraft. We have already proposed a fast 3-D imaging algorithm, SEABED, that utilizes a reversible transform between the time delay and the target boundary. However, data acquisition is time-consum...
متن کاملFast 3-d optical imaging with transient fluorescence signals.
A fast 3-D optical imaging method with use of exogenous fluorescence agent is proposed and demonstrated by simulation in a model tissue. After administration of fluorescent agent, ultrashort near-infrared laser pulses are used to illuminate the tissue and excite fluorescence emission. The transient fluorescence signals are detected on the tissue boundaries and employed to reconstruct a 3-D imag...
متن کاملFast algorithm for 3-D vascular tree modeling
In this short paper, accelerated three-dimensional computer simulations of vascular trees development, preserving physiological and haemodynamic features, are reported. The new computation schemes deal: (i). with the geometrical optimization of each newly created bifurcation; and (ii). with the recalculation of blood pressures and radii of vessels in the whole tree. A significant decrease of th...
متن کاملFast Codevector Search Algorithm for 3-D Vector Quantized Codebook
This paper presents a very simple and efficient algorithm for codebook search, which reduces a great deal of computation as compared to the full codebook search. The algorithm is based on sorting and centroid technique for search. The results table shows the effectiveness of the proposed algorithm in terms of computational complexity. In this paper we also introduce a new performance parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2019
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0222729